Interactive and Robust Mesh Booleans

Boolean operations are among the most used paradigms to create and edit digital shapes. Despite being conceptually simple, computation of mesh Booleans is notoriously challenging. Main issues come from numerical approximations that make detection processing intersection points inconsistent unreliable, exposing implementations based on floating point arithmetic many kinds degeneracy failure. Numerical methods rational numbers or exact geometric predicates have needed robustness guarantees, achieved at cost increased times that, as today, has always restricted use robust offline applications. We introduce an algorithm for with guarantees capable operating interactive frame rates meshes up 200K triangles. evaluate our tool thoroughly, considering not only applications but also batch large collections meshes, huge containing millions elements variadic hundreds shapes altogether. In all these experiments, we consistently outperform prior by least one order magnitude.